On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
نویسندگان
چکیده
منابع مشابه
On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
We consider the class of quadratically-constrained quadratic-programming methods in the framework extended from optimization to more general variational problems. Previously, in the optimization case, Anitescu (SIAM J. Optim. 12, 949–978, 2002) showed superlinear convergence of the primal sequence under the Mangasarian-Fromovitz constraint qualification and the quadratic growth condition. Quadr...
متن کاملOn the Sequential Quadratically Constrained Quadratic Programming Methods
An iteration of the sequential quadratically constrained quadratic programming method (SQCQP) consists of minimizing a quadratic approximation of the objective function subject to quadratic approximation of the constraints, followed by a linesearch in the obtained direction. Methods of this class are receiving attention due to the development of efficient interior point techniques for solving s...
متن کاملA Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming
In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a convex quadratic function subject to finitely many convex quadratic inequality constraints. The algorithm is shown to converge globally and possess stronger local superlinear convergence. Preliminary numerical results are also reported.
متن کاملOn convex relaxations for quadratically constrained quadratic programming
We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let F denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on F is dominated by an alternative methodology based ...
متن کاملA Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
We present an algorithm that achieves superlinear convergence for nonlinear programs satisfying the Mangasarian-Fromovitz constraint qualiication and the quadratic growth condition. This convergence result is obtained despite the potential lack of a locally convex augmented Lagrangian. The algorithm solves a succession of subproblems that have quadratic objective and quadratic constraints, both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2007
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-007-9064-6